One-dimensional linear recursions with Markov-dependent coefficients
نویسنده
چکیده
For a class of stationary Markov-dependent sequences (ξn, ρn) ∈ R 2, we consider the random linear recursion Sn = ξn + ρnSn−1, n ∈ Z, and show that the distribution tail of its stationary solution has a power law decay. An application to random walks in random environments is discussed. MSC2000: primary 60K15 ; secondary 60K20, 60K37.
منابع مشابه
Multivariate linear recursions with Markov-dependent coefficients
We study a linear recursion with random Markov-dependent coefficients. In a “regular variation in, regular variation out” setup we show that its stationary solution has a multivariate regularly varying distribution. This extends results previously established for i.i.d. coefficients.
متن کاملONE-DIMENSIONAL LINEAR RECURSIONS WITH MARKOV-DEPENDENT COEFFICIENTS BY ALEXANDER ROITERSHTEIN University of British Columbia
with real-valued random coefficients An and Bn. If the sequence of random pairs (An,Bn)n∈Z is stationary and ergodic, E(log |B0|) < 0, and E(log |A0|+) < ∞, where x+ = max(0, x), then for any initial random value S0, the limit law of Sn is the same as that of the random variable R =A0 +∑∞n=1 A−n∏n−1 i=0 B−i , and it is the unique initial distribution under which (Sn)n≥0 is stationary (cf. [6])....
متن کاملLarge Deviations for Past-Dependent Recursions
The Large Deviation Principle is established for stochastic models defined by past-dependent non linear recursions with small noise. In the Markov case we use the result to obtain an explicit expression for the asymptotics of exit time.
متن کاملStationary Markov chains with linear regressions
In Bryc(1998) we determined one dimensional distributions of a stationary field with linear regressions (1) and quadratic conditional variances (2) under a linear constraint (7) on the coefficients of the quadratic expression (3). In this paper we show that for stationary Markov chains with linear regressions and quadratic conditional variances the coefficients of the quadratic expression are i...
متن کاملA Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کامل